Brief Announcement: Relay: A Cache-Coherence Protocol for Distributed Transactional Memory
نویسندگان
چکیده
Transactional memory is an alternative programming model for managing contention in accessing shared in-memory data objects. Distributed transactional memory promises to alleviate difficulties with lock-based (distributed) synchronization and object performance bottlenecks in distributed systems. The design of the cache-coherence protocol is critical to the performance of distributed transactional memory systems. We evaluate the performance of a cache-coherence protocol by measuring its worst-case competitive ratio — i.e., the ratio of its makespan to the makespan of the optimal cache-coherence protocol. We establish the upper bound of the competitive ratio and show that it is determined by the worst-case number of abortions, maximum locating stretch, and maximum moving stretch of the protocol — the first such result. We present the Relay protocol, a novel cache-coherence protocol, which optimizes these values, and evaluate its performance. We show that Relay’s competitive ratio is significantly improved by a factor of O(Ni) for Ni transactions requesting the same object when compared against past distributed queuing protocols.
منابع مشابه
On Transactional Scheduling in Distributed Transactional Memory Systems
We present a distributed transactional memory (TM) scheduler called Bi-interval that optimizes the execution order of transactional operations to minimize conflicts. Bi-interval categorizes concurrent requests for a shared object into read and write intervals to maximize the parallelism of reading transactions. This allows an object to be simultaneously sent to nodes of reading transactions (in...
متن کاملDistributed Queuing or Distributed Priority Queuing? On the Design of Cache-Coherence Protocols for Distributed Transactional Memory
Distributed transactional memory (TM) promises to alleviate difficulties with lock-based (distributed) synchronization and object performance bottlenecks in distributed systems. In distributed TM systems, both the management and consistency of a distributed transactional object are ensured by a cache-coherence protocol. In this paper, we formalize two classes of cache-coherence protocols: distr...
متن کاملQueuing or Priority Queuing? On the Design of Cache-Coherence Protocols for Distributed Transactional Memory
Distributed transactional memory (TM) promises to alleviate difficulties with lock-based (distributed) synchronization and object performance bottlenecks in distributed systems. In distributed TM systems, both the management and consistency of a distributed transactional object are ensured by a cache-coherence protocol. In this paper, we formalize two classes of cache-coherence protocols: distr...
متن کاملSupporting Transactional Memory in Distributed Systems based on the Data-Flow Model
A distributed TM model supports the TM API in a distributed system consisting of a network of nodes that communicate by message-passing links. Supporting TM in distributed systems is motivated by the difficulties of lockbased synchronization methods employed by existing distributed control-flow programming models such as RPCs. We consider Herlihy and Sun’s data-flow distributed TM model [3]. In...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009